Coordinate Grammar
نویسنده
چکیده
Chomsky (1959a) presented an algorithm for constructing a finite transducer that is strongly equivalent to a Chomsky-normal-form context-free grammar for all sentences generated by that grammar with up to any specified finite degree of center embedding. This article presents a new solution using a variety of COORDINATE GRAMMAR to assign nonembedding (paratactic) structures strongly equivalent to those assigned by an embedding grammar, which can in turn be directly computed by a finite transducer. It proposes that the bound on center embedding is really a consequence of a bound on alternation between right and left embedding, called here ZIGZAG EMBEDDING. Coordinate grammars can also be used to assign nonembedding structures equivalent to those with up to any specified finite degree of coordinate embedding (the occurrence of a coordinate structure as a member of a coordinate structure of the same type). It concludes that coordinate grammars or the finite transducers strongly equivalent to them are psychologically real, and that the existence of a finite bound on the degree of zigzag and coordinate embedding is a consequence of the increasing size and complexity of such grammars or transducers as the bound increases.*
منابع مشابه
Constituent Coordination in Lexical-Functional Grammar*
This paper outlines a theory of constituent coordination for Lexical-Functional Grammar. On this theory LFG’s flat, unstructured sets are used as the functional representation of coordinate constructions. Function-application is extended to sets by treating a set formally as the generalization of its functional elements. This causes properties attributed externally to a coordinate structure to ...
متن کاملClausal Coordinate Ellipsis in German: The TIGER Treebank as a Source of Evidence
Syntactic parsers and generators need highquality grammars of coordination and coordinate ellipsis—structures that occur very frequently but are much less well understood theoretically than many other domains of grammar. Modern grammars of coordinate ellipsis are based nearly exclusively on linguistic judgments (intuitions). The extent to which grammar rules based on this type of empirical evid...
متن کاملDealing With Conjunctions In A Machine Translation Environment
The paper presents an algorithm, written in PROLOG, for processing English sentences which contain either Gapping, Right Node Raising (RNR) or Reduced Conjunction (RC). The DCG (Definite Clause Grammar) formalism (Pereira & Warren 80) is adopted. The algorithm is highly efficient and capable of processing a full range of coordinate constructions containing any number of coordinate conjunctions ...
متن کاملTemplate Construction Grammar: a Schema-Theoretic Computational Construction Grammar
Template Construction Grammar (TCG) was developed as part of an effort to build a system-level neuro-computational model simulating the dynamics at play during languagevision interactions. This paper presents TCG as a computational framework designed to model the human brain’s capacity to dynamically coordinate two concurrent incremental processes, one generating a message and the other organiz...
متن کاملConstituent coordination in LFG
Ahs t r ac t : This paper outl ines a theory of const i tuent coordination For l ,exicaI-Funetional Grammar. On this theory LFG's flat, unstructured nets are used as the functional representat ion of coordinate constructions, l"unction application is extended to sets by t rea t ing a set tbrmally am the general izat ion of its Functional clmnents. This causes properties a t t r ibuted external ...
متن کامل